Please consider donating to the Computer Science Club to help offset the costs of bringing you our talks.
Abstract
Finding shortest paths is a problem that comes up in many applications: Google maps, network routing, motion planning, connectivity in social networks, and etc. The domain may be a graph, either explicitly or implicitly represented, or a geometric space.
Professor Lubiw will survey the field, from Dijkstra's foundational algorithm to current results and open problems. There will be lots of pictures and lots of ideas.
Download
BitTorrent: Talk (x264)
HTTP (web browser): Talk (x264)
Please consider donating to the Computer Science Club to help offset the costs of bringing you our talks.